Seamlessly conferencing a previously-connected telephone call

ABSTRACT

An already-connected telephone call is conferenced in a seamless manner that is transparent to the call participants, after which one or more additional participants may join the conference. The existing call is preferably moved to a conference bridge responsive to an existing call participant either logging on to a network-accessible user interface (such as a web page or portal-type page) or entering some special key or key combination using the participant&#39;s phone (which may be a software application that provides phone-like services). The participant requesting the move may be authenticated, and the authorization of the participant to request the move may be verified, before moving the call.

BACKGROUND

The present invention relates to telephone conference calls, and deals more particularly with conferencing an already-connected telephone call in a seamless manner that is transparent to the call participants.

When two people are participating in a telephone call, they may decide that it would be useful if one or more other persons were also participating. For example, the current call participants may be work colleagues who are discussing an urgent problem, and they might decide that one or more of their co-workers could provide valuable insight into the problem. Currently, the existing telephone call has to be terminated, and a new telephone call has to be initiated using a conference bridge.

BRIEF SUMMARY

The present invention is directed to seamlessly conferencing an already-connected telephone call. In one aspect, this comprises: receiving a request to conference an existing connected telephone call; responsive to receiving the request, retrieving stored session information of an existing session for a calling party of the existing connected telephone call and an existing session for a called party of the existing connected telephone call; non-disruptively establishing a conference between the calling party and the called party, using the retrieved session information; and moving the existing session for the calling party and the existing session for the called party to the conference. This aspect may further comprise: sending a first invitation message to the existing session for the calling party that invites a first user agent associated with the existing session for the calling party to connect to a conference session of the conference; sending a second invitation message to the existing session for the called party that invites a second user agent associated with the existing session for the called party to connect to the conference session of the conference; and adding at least one additional party to the conference by establishing a new session for each additional party and connecting each new session to the conference.

Embodiments of these and other aspects of the present invention may be provided as methods, systems, and/or computer program products. It should be noted that the foregoing is a summary and thus contains, by necessity, simplifications, generalizations, and omissions of detail; consequently, those skilled in the art will appreciate that the summary is illustrative only and is not intended to be in any way limiting. Other aspects, inventive features, and advantages of the present invention, as defined by the appended claims, will become apparent in the non-limiting detailed description set forth below.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

The present invention will be described with reference to the following drawings, in which like reference numbers denote the same element throughout.

FIG. 1 illustrates an example of establishing a call telephone call between two parties, according to the prior art;

FIG. 2 illustrates how the previously-established telephone call of FIG. 1 may be seamlessly moved to a conference bridge, thereby allowing participation by additional parties, according to an embodiment of the present invention;

FIG. 3 illustrates sample data structures which may be used for storing information used by an embodiment of the present invention;

FIG. 4 depicts a data processing system suitable for storing and/or executing program code; and

FIG. 5 depicts a representative networking environment in which one or more embodiments of the present invention may be used.

DETAILED DESCRIPTION

When two people are participating in a telephone call using known techniques and decide, during the phone call, that they would like to include one or more other participants, the existing call has to be terminated so that a new call can be established using a conference bridge that will support more than two connections. Terminating the existing call and establishing a new one for restarting the now-ended conversation by calling into a conference bridge is inconvenient.

An embodiment of the present invention is directed toward seamlessly conferencing the already-connected call. That is, the existing call is seamlessly moved to a conference bridge, in a nondisruptive manner—that is, without terminating the existing call and without requiring the call participants to establish a new call. Additional participants can then call in to the conference bridge and join the conference that is already in progress. This approach is much less disruptive to the original call participants. (The additional participants need not be aware that the conference call was originally a call between only two parties.)

According to an embodiment of the present invention, the call is moved to the conference bridge responsive to an existing call participant either logging on to a network-accessible user interface (such as a web page or portal-type page) or entering some special key or key combination using the participant's phone. (The authorization of the requesting participant may also be verified.) This signals the underlying phone system which is supporting the existing phone call to perform the moving of the existing call. Preferably, the phone system first performs an authentication of the party who requests the move to the conference bridge, and if this authentication is successful, the phone system dynamically moves the existing phone call to a conference bridge. As a result, the two original call participants are instantly and seamlessly joined into a conference call, without having to dial into a bridge (and without having to terminate their existing call). Notably, the call participants are no longer connected directly to each other after the call is moved, but instead are connected through a conference bridge. Other participants can then join into the phone call by directly dialing into the bridge—and these other participants will detect no difference between this conference call and one that is initially established as a conference call.

FIG. 1 illustrates an example of establishing a telephone call between two parties, according to the prior art. (FIG. 2, discussed below, illustrates how the previously-established call of FIG. 1 may be seamlessly moved to a conference bridge, thereby allowing participation by additional parties, according to an embodiment of the present invention.) The information flow shown in FIG. 1 is described with regard to a known Session Initiation Protocol, which is commonly referred to as “SIP”. (SIP is described in Request for Comments (RFC) 3261 from the Internet Engineering Task Force, which is titled “SIP: Session Initiation Protocol”. Specific details of existing SIP processing which are not necessary to an understanding of the present invention are omitted herein.)

FIG. 1 illustrates a phone call between a calling party Allen and a called party Bob. Conventional SIP techniques may be used for establishing this phone call, as will now be briefly described. A conventional SIP environment includes a proxy server (see reference number 150) and one or more application servers (see reference numbers 160, 161) which may be organized as an application server cluster. In this example, Allen initiates the call by sending a SIP INVITE request message (see reference number 101) from a user agent executing on his behalf to the proxy server 150. (Note that the user agent for the SIP call participants may be software executing on a computing device. Because this user agent provides calling services, it is also referred to and illustrated herein as a telephone. The term “softphone” is sometimes used when referring to the SIP user agent client which runs on a personal computer or laptop which enables the user's telephone call connection.) According to the SIP protocol, the proxy server 150 is responsible for various call routing functions. The proxy server forwards the SIP INVITE request 101 to application server 160 (see reference number 102). In this example of FIG. 1, the application server 160 forwards 104 the INVITE request to the proxy server 150, which routes it 105 to the user agent representing Bob's telephone. (Note that the application server may directly contact the called party without going through the proxy server, although this has not been illustrated in FIG. 1.) When Bob answers the incoming call, a call is established between Allen and Bob (see reference number 106), and they may then begin talking.

Referring now to FIG. 2, the previously-established call of FIG. 1 is seamlessly moved to a conference bridge using techniques disclosed herein, as will now be described. For the telephone call that was established in FIG. 1, application server 160 according to the present invention updates the database 170 with further details regarding the SIP application sessions of the calling and called parties (see reference numbers 103, 107). This information is discussed in more detail below, with reference to FIG. 3. At some point during the established call, Allen and Bob decide that they would like to conference one or more other participants into their call. One of the parties therefore sends a signal, through the proxy server, to request the move to the conference bridge. The move request may be signaled responsive to the requesting party pressing a key or key sequence on the party's telephone, or by logging on to a web-accessible application where an activation indicator (such as a graphical button) is provided through a user interface, and so forth. By way of illustration, in the example shown in FIG. 2, Bob is the person who signals the move request to the proxy server (see reference number 108), and this comprises Bob logging onto a web-accessible application using a laptop 140 (or other appropriate device, equivalently). As a condition precedent to moving the existing call to a conference, an authentication process may be performed to authenticate the participant initiating the request. In one approach, a web page is displayed (not shown in FIG. 2), whereby Bob may be required to provide a user identifier and password (or other type of identifying information which can be used for authentication) that can be used to ensure that the request to move the call is authentic (e.g., that the request originates from the party represented in the request). As noted earlier, an authorization process may also be performed to verify that Bob is authorized to request moving the call to a conference bridge. Known techniques for authentication and authorization are preferably used.

Responsive to receiving the move request (and authenticating and verifying authorization, as appropriate), the application servers realize the person requesting a conference is already connected to another party and retrieve information pertaining to the SIP session of the requesting party (i.e., Bob, in this example) as well as information pertaining to the SIP session of the other participant in the existing call. This retrieval is illustrated in FIG. 2 at reference numbers 109, 110. At reference number 109, the proxy server sends a retrieval request to an application server 161, and at reference number 110, the application server then retrieves the requested information from the database 170. The retrieved information is then returned in a response that preferably follows the reverse message path 110, 109. (It should be noted that the message flows shown at 109, 110 would typically pass through application server 160 instead of application server 161. FIG. 2 depicts application server 161 as performing the information retrieval 109, 110 to illustrate the ability to distribute processing among more than one of the application servers in the cluster.)

Upon retrieving session information pertaining to the existing call, a conferencing session is initiated on an available application server, which is application server 161 in the example of FIG. 2. In turn, the conferencing session creates a conference on an available media server. This conferencing session is also referred to herein as a conference bridge. As illustrated in the example of FIG. 2, a media servers cluster may contain a plurality of media servers 180, 181, and the conference bridge is depicted as being created on media server 181 (see reference number 111).

Once the conferencing session establishes the new conference in this manner, the conferencing session on application server 161 sends requests to the SIP sessions of the original parties that reside on application server 160. These requests are depicted at reference numbers 112 and 113, and provide information that enables the SIP sessions to join the new conference. In one embodiment, the asynchronous invocation API of WebSphere Application Server is used at application server 160 for receiving the requests in message flows 112, 113. (“WebSphere” is a registered trademark of International Business Machines Corporation in the United States, other countries, or both.)

Responsive to receiving the requests to join the newly-established conference, the application server 160 causes the SIP sessions of the original call participants to join the newly-established conference. See reference numbers 114, 115, which represent message flows from the SIP sessions on application server 160 to the conference on media server 181. In one embodiment, conventional SIP INVITE messages are used in these message flows 114, 115, and result in adding the original call participants (i.e., the sessions of Allen and Bob) to the conference. In turn, after the SIP sessions for the two participants have been added to the conference in media server 181, their SIP sessions at application server 160 send reINVITE messages to their corresponding telephones or devices. Reference numbers 116 and 117 show the reINVITE message sent from the SIP session for Allen, through the proxy server 150 and on to Allen's telephone. Similarly, reference number 118 and 119 show the reINVITE message sent from the SIP session for Bob, through the proxy server 150 and on to Bob's telephone. Note that the messages to Allen and Bob may be sent simultaneously. These reINVITE messages contain Session Description Protocol (“SDP”) information that enables the original participants' telephones to be connected through the conference on the media server 181. Reference numbers 120 a, 120 b depict the resulting seamlessly-moved connection between Allen and Bob. The parties are now connected through the conference, without having to hang up their initial (i.e., already-established) call and without having to dial into a conference bridge. Additional participants may now call the conference bridge and connect into the conference using existing techniques.

The participant who requests the conferencing of the existing call may select other participants to be included in the conference call. This may be done in various ways. In one approach, a company directory or a personal address book is accessed, and entries from the directory or address book are displayed on a user interface from which the participant who requests the conference can then select one or more people to be added to, or to be invited to join, the conference. In another approach, the participant requesting the conferencing of the existing call may enter one or more telephone numbers of participants who are selected for adding to the conference. The other selected parties are then automatically called, and connected to the conference upon answering the call. A conference is therefore set up among all the original participants as well as one or more other participants.

FIG. 3 illustrates sample data structures which may be used for storing information used by an embodiment of the present invention, as will now be described. (As will be obvious, the data structures and contents thereof as shown in FIG. 3 are merely illustrative. Additional and/or different information may be provided without deviating from the scope of the present invention, and storage means other than tables in a database may be used without deviating from the scope of the present invention.)

An Active Calls table 300 stores information pertaining to active calls, such as the call 106 between Allen and Bob which was discussed above with reference to FIG. 1. (The information in Active Calls table 300, as well as the information in tables 320 and 340 which are discussed below, may be stored in the database 170 which was discussed above with reference to FIG. 2.) In this sample table 300, the stored information comprises a call index number 301, the telephone number of the calling party 302, and the telephone number of the called party 303. See row 310, which depicts a sample call index number of “1”, a sample calling party number of “555-555-0001”, and a sample called party number of “555-555-0002”. The information in columns 302, 303 of table 300 may be stored responsive to message flows 103, 107 of FIG. 2 (and the information in column 301 is preferably generated as a unique index for identifying each row).

An Active Sessions table 320 stores information about currently-active sessions. In the sample table 320, the stored information comprises a session number 321, an application session identifier (hereinafter, “ID”) 322, the phone number of the calling party 323, and a conference session identifier 324. Row 330 of the sample data depicts a session ID of “1”, an application session ID of “app1.1234567890_(—)12345”, a calling party number of “555-555-0001”, and a conference session ID of “app3.0987654321_(—)32145”. Row 331 of the sample data depicts a session ID of “2”, an application session ID of “app2.15432167890_(—)98876”, a calling party number of “555-555-0002”, and a conference session ID of “app3.0987654321_(—)32145”. The information in columns 322, 323 of table 320 may be stored responsive to message flow 107 of FIG. 2 (and the information in column 321 is preferably generated as a unique index for identifying each row), where each SIP session has a separate row in the table. Row 330 may therefore represent the SIP session of Allen, while row 331 represents the SIP session of Bob.

The information in column 324 may be empty (or a nil value) while the parties are participating in a conventional, non-conference call, and an actual session ID may then be inserted into column 324 when a conference is established for moving that call (such as the conference discussed above with regard to reference number 111 of FIG. 2). Accordingly, both of rows 330 and 331 use the same conference session ID value in column 324, indicating that the application sessions represented by these 2 rows are participating in the same conference.

A Conferences table 340 stores information about currently-active conferences. In the sample table 340, the stored information comprises a conference number 341, a conference session ID 342, and a list 343 comprising the application session ID of each participant in that conference. Row 350 of the sample data depicts a conference number of “9”, a conference session ID of “app3.0987654321_(—)32145”, and a list with application session IDs “app1.1234567890_(—)12345” and “app2.15432167890_(—)98876”. Note that the entries in table 340 are related to the entries in table 320. As one example, the conference session ID values from column 324 of table 320 may used as pointers, or references, to values found in column 342 of table 340. As another example, the conference participant session IDs in the list in column 343 of table 340 may be used as pointers, or references, to entries in column 322 of table 320. Thus, in the sample tables, row 350 indicates that a conference session having conference session ID “app3.0987654321_(—)32145” (column 342) exists and that the current participants in this conference use the application sessions “app 1.1234567890_(—)12345” and “app2.15432167890_(—)98876” (column 343). These application session IDs from the list in column 343 of table 340 can be used as pointers to column 322 of table 320 in order to locate the phone number for the calling party (from column 323) of the respective participant sessions. The information in columns 342, 343 of table 340 may be stored responsive to message flows 112, 113 of FIG. 2 (and the information in column 341 is preferably generated as a unique index for identifying each row). As additional participants join the conference, a row to represent a new application session for each such additional participant is added to table 320 and a corresponding entry is added to the list of application session IDs in column 343 of table 340.

Referring now to FIG. 4, a data processing system 400 suitable for storing and/or executing program code includes at least one processor 412 coupled directly or indirectly to memory elements through a system bus 414. The memory elements can include local memory 428 employed during actual execution of the program code, bulk storage 430, and cache memories (not shown) which provide temporary storage of at least some program code in order to reduce the number of times code must be retrieved from bulk storage during execution.

Input/output (“I/O”) devices (including but not limited to keyboards 418, displays 424, pointing devices 420, other interface devices 422, etc.) can be coupled to the system either directly or through intervening I/O controllers or adapters (416, 426).

Network adapters may also be coupled to the system to enable the data processing system to become coupled to other data processing systems or remote printers or storage devices through intervening private or public networks (as shown generally at 432). Modems, cable modem attachments, wireless adapters, and Ethernet cards are just a few of the currently-available types of network adapters.

FIG. 5 illustrates a data processing network environment 500 in which the present invention may be practiced. The data processing network 500 may include a plurality of individual networks, such as wireless network 542 and wired network 544. A plurality of wireless devices 510 may communicate over wireless network 542, and a plurality of wired devices, shown in the figure (by way of illustration) as workstations 511, may communicate over network 544. Additionally, as those skilled in the art will appreciate, one or more local area networks (“LANs”) may be included (not shown), where a LAN may comprise a plurality of devices coupled to a host processor. A public switched telephone network (“PSTN”) 550 may be connected to wired network 544, and a plurality of telephones 551, 552 may be connected to the PSTN 550.

Still referring to FIG. 5, the networks 542 and 544 may also include mainframe computers or servers, such as a gateway computer 546 or application server 547 (which may access a data repository 548). A gateway computer 546 serves as a point of entry into each network, such as network 544. The gateway 546 may be preferably coupled to another network 542 by means of a communications link 550 a. The gateway 546 may also be directly coupled to one or more workstations 511 using a communications link 550 b, 550 c, and/or may be indirectly coupled to such devices. The gateway computer 546 may be implemented utilizing an Enterprise Systems Architecture/390® computer available from IBM. Depending on the application, a midrange computer, such as an iSeries®, System i™, and so forth may be employed. (“Enterprise Systems Architecture/390” and “iSeries” are registered trademarks of IBM in the United States, other countries, or both, and “System i” is a trademark of IBM.)

The gateway computer 546 may also be coupled 549 to a storage device (such as data repository 548).

Those skilled in the art will appreciate that the gateway computer 546 may be located a great geographic distance from the network 542, and similarly, the workstations 511 may be located some distance from the networks 542 and 544, respectively. For example, the network 542 may be located in California, while the gateway 546 may be located in Texas, and one or more of the workstations 511 may be located in Florida. The workstations 511 may connect to the wireless network 542 using a networking protocol such as the Transmission Control Protocol/Internet Protocol (“TCP/IP”) over a number of alternative connection media, such as cellular phone, radio frequency networks, satellite networks, etc. The wireless network 542 preferably connects to the gateway 546 using a network connection 550 a such as TCP or User Datagram Protocol (“UDP”) over IP, X.25, Frame Relay, Integrated Services Digital Network (“ISDN”), Public Switched Telephone Network (“PSTN”), etc. The workstations 511 may connect directly to the gateway 546 using dial connections 550 b or 550 c. Further, the wireless network 542 and network 544 may connect to one or more other networks (not shown), in an analogous manner to that depicted in FIG. 5.

As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method, or computer program product. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.), or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit”, “module”, or “system”. Furthermore, aspects of the present invention may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.

Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (“RAM”), a read-only memory (“ROM”), an erasable programmable read-only memory (“EPROM” or flash memory), a portable compact disc read-only memory (“CD-ROM”), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain or store a program for use by or in connection with an instruction execution system, apparatus, or device.

A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.

Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, radio frequency, etc., or any suitable combination of the foregoing.

Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++, or the like, and conventional procedural programming languages such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer, or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computing device through any type of network, including a local area network (“LAN”) or a wide area network (“WAN”), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).

Aspects of the present invention are described above with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.

The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus, or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.

Flowcharts and block diagrams in the figures herein illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the blocks may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or each flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

While embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims shall be construed to include the described embodiments and all such variations and modifications as fall within the spirit and scope of the invention. 

1. A computer-implemented method of seamlessly conferencing a telephone call, comprising: receiving a request to conference an existing connected telephone call; responsive to receiving the request, retrieving stored session information of an existing session for a calling party of the existing connected telephone call and an existing session for a called party of the existing connected telephone call; non-disruptively establishing a conference between the calling party and the called party, using the retrieved session information; and moving the existing session for the calling party and the existing session for the called party to the conference.
 2. The method according to claim 1, further comprising adding an additional party to the conference by establishing a new session for the additional party and connecting the new session for the additional party to the conference.
 3. The method according to claim 1, further comprising: sending a first invitation message to the existing session for the calling party that invites a first user agent associated with the existing session for the calling party to connect to a conference session of the conference; and sending a second invitation message to the existing session for the called party that invites a second user agent associated with the existing session for the called party to connect to the conference session of the conference.
 4. The method according to claim 1, wherein: the existing session for the calling party comprises a first Session Initiation Protocol (“SIP”) session; the existing session for the called party comprises a second SIP session; the first SIP session invites a first user agent associated with the first SIP session to connect to a conference session of the conference; and the second SIP session invites a second user agent associated with the second SIP session to connect to the conference session of the conference.
 5. The method according to claim 1, wherein: the stored session information of the existing session for the calling party comprises a phone number of the calling party and an application session identifier of the existing session for the calling party; and the stored session information of the existing session for the called party comprises a phone number of the called party and an application session identifier of the existing session for the called party.
 6. The method according to claim 1, wherein: the non-disruptively establishing further comprises non-disruptively establishing the conference with an application program that accesses the stored session information of the existing session for the calling party and the stored session information of the existing session for the called party; and the moving further comprises moving, by the application program, the existing session for the calling party and the existing session for the called party to the conference.
 7. The method according to claim 6, wherein the application program stores, for the established conference, an application program session identifier, a link to the stored session information of the existing session for the calling party, and a link to the stored session information of the existing session for the called party.
 8. The method according to claim 1, wherein the request to conference is initiated by one of the calling party and the called party, and wherein the request is signaled by entry of a key or key sequence or by entry of a request indicator on an application interface.
 9. The method according to claim 8, wherein the non-disruptively establishing and the moving are performed responsive to authenticating identifying information of the initiator of the request and verifying that the initiator is authorized to make the request
 10. The method according to claim 1, further comprising: sending a first invitation message to the existing session for the calling party that invites a first user agent associated with the existing session for the calling party to connect to a conference session of the conference; sending a second invitation message to the existing session for the called party that invites a second user agent associated with the existing session for the called party to connect to the conference session of the conference; and for each of at least one additional party, sending an invitation message to a session created for adding the additional party to the conference, the invitation message inviting a user agent associated with the created session to connect to the conference session of the conference. 